package leetcode;

import java.util.Arrays;

import org.junit.Test;

public class TwoSum {

	/*
	 * Given nums = [2, 7, 11, 15], target = 9,
	 * 
	 * Because nums[0] + nums[1] = 2 + 7 = 9, return [0, 1].
	 */

	public int[] twoSum(int[] nums, int target) {
	/*	for (int i = 0; i < nums.length; i++) {
			for (int j = i + 1; j < nums.length; j++) {
				if (target - nums[i] == nums[j]) {
					return new int[] { i, j };
				}
			}
		}*/
		int i = 0;
		int j = 0;
		while (i < nums.length) {
			j=i+1;
			while (j < nums.length) {
				if (target - nums[i] == nums[j]) {
					return new int[] { i, j };
				}
				j++;
			}
			i++;
		}
		return new int[] {};
	}

	@Test
	public void testtwoSum() {
		int[] nums = { 3, 2, 4 };
		int taget = 6;
		int[] x = twoSum(nums, taget);
		System.out.println(Arrays.toString(x));
	}
}
